Zeszyty Naukowe Un Iwersytetu Jag Ie Llo Ń Sk Iego

نویسندگان

  • Jan J. Mulawka
  • Tomasz Janczak
  • Artur Malinowski
  • Robert Nowak
چکیده

Molecular computing is a new multidisciplinary area of research concerned with design, and theoretical and empirical understanding of computing gleaned from nature. It aims at the implementation of algorithms in molecular hardware, e.g. using DNA molecules and enzymes. The main advantages of the molecular computing lie in the possibility to obtain a massive parallelism of computation and associative memory of high capacity. The primary objectives of this paper are to discuss fundamental concepts of molecular computing and basic processes of standard genetic engineering used for DNA computing. In particular, such processes like hybridization, ligation, PCR, affinity separation, restriction enzyme digestion, and electrophoresis will be considered. Next, we provide computation models and algorithms applied in this area. We show that biochemical reactions may be used for performing molecular inference according to the algorithm of either forward or backward chaining. Finally, we concentrate on realization issues. Basic properties of DNA chips as well as data flow microreactors will be considered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zeszyty Naukowe Un Iwersytetu Jag Ie Llo Ń Sk Iego

Properties of actual and future languages for Multi-Agent System designing are outlined. This approach includes principles of Multi-Agent System programming: description of agent mental state, synchronous and asynchronous communication mechanisms, agent interpreter cycle, etc. An alternative approach is to adopt the used programming languages to design the Multi-Agent System. This approach is o...

متن کامل

Zeszyty Naukowe Un Iwersytetu Jag Ie Llo Ń Sk Iego

Problem solving with multi-agent systems appears to be a very active research area nowadays. We present in this talk an overview of some works around distributed Constraint Satisfaction Problems and we point out some recent results about phase tarnsition and emergence in multi-agents resolution of such problems. We also point out the links and differences with distributed or randomized algorithms.

متن کامل

Zeszyty Naukowe Un Iwersytetu Jag Ie Llo Ń Sk Iego

The study of multiagent distributed systems through the optics of the theory of formal grammars and languages is presented. Models based on NLC and BNLC graph grammars are mainly considered. The basic intuition of a grammar model of distributed systems follows the blackboard model for problem solving and is the following: component grammars forming the distributed system execute rewritings on a...

متن کامل

Zeszyty Naukowe Politechniki Białostockiej. Informatyka an Algorithm for Generating Binary Pseudo-random Sequences

In the paper it is presented an algorithm for generating pseudo-random binary sequences. There are formulated theorems concerning properties of the sequence generated by the algorithm. The sequence is not periodic. Moreover, for any natural number n > 0, the initial fragment of the generated sequence of the length (2 · n) · 2(2·n) contains all (binary) series of the length n.

متن کامل

Zeszyty Naukowe Politechniki Białostockiej. Informatyka an Improved Approximation Algorithm for Optimal Routes Generation in Public Transport Network

This paper presents a new version of Routes Generation Matrix Algorithm, called Routes Generation Matrix Improved Algorithm (RGMIA), for determining routes with optimal travel time in public transport network. The method was implemented and tested on the real public transport network in Warsaw city. This network was completed with walk links and therefore resultant routes are more practical and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007